A distance between isomorphism classes of trees

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On Distances between Isomorphism Classes of Graphs

Various measures of distance between (the isomorphism classes of) two graphs have been proposed. These include measures proposed by Zelinka [6],[7], Baláž, Koča, Kvasńıčka & Sekanina [1] and Johnson [4]. Further, there is the edge rotation distance of Chartrand, Saba & Zou [3] and the edge shift distance of Johnson [5]. It is on the latter two that we build. For terminology and notation not exp...

متن کامل

Interleaving Distance between Merge Trees

Merge trees are topological descriptors of scalar functions. They record how the subsets of the domain where the function value does not exceed a given threshold are connected. We define a distance between merge trees, called an interleaving distance, and prove the stability of these trees, with respect to this distance, to perturbations of the functions that define them. We show that the inter...

متن کامل

Edge Shift Distance between Trees

Edge shift distance between isomorphism classes of graphs, introduced by M. Johnson, is investigated in the case of trees and compared with other distances .

متن کامل

Isomorphism classes of A-hypergeometric systems

For a finite set A of integral vectors, Gel’fand, Kapranov and Zelevinskii defined a system of differential equations with a parameter vector as a D-module, which system is called an A-hypergeometric (or a GKZ hypergeometric) system. Classifying the parameters according to the Disomorphism classes of their corresponding A-hypergeometric systems is one of the most fundamental problems in the the...

متن کامل

On isomorphism classes of generalized Fibonacci cubes

The generalized Fibonacci cube Qd(f) is the subgraph of the d-cube Qd induced on the set of all strings of length d that do not contain f as a substring. It is proved that if Qd(f) ∼= Qd(f ′) then |f | = |f ′|. The key tool to prove this result is a result of Guibas and Odlyzko about the autocorrelation polynomial associated to a binary string. An example of a family of such strings f , f ′, wh...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Czechoslovak Mathematical Journal

سال: 1983

ISSN: 0011-4642,1572-9141

DOI: 10.21136/cmj.1983.101863